Local Quasi-Monte Carlo Exploration
نویسندگان
چکیده
In physically-based image synthesis, the path space of light transport paths is usually explored by stochastic sampling. The two main families of algorithms are Monte Carlo/quasi-Monte Carlo sampling and Markov chain Monte Carlo. While the former is known for good uniform discovery of important regions, the latter facilitates efficient exploration of local effects. We introduce a hybrid sampling technique which uses quasi-Monte Carlo points to achieve good stratification in both stages: we use the Halton sequence to generate initial seed paths and rank-1 lattices for local exploration. This method avoids the hard problem of introducing QMC sequences into MCMC while still stratifying samples both globally and locally. We propose perturbation strategies that prefer dimensions close to the camera, facilitating efficient reuse of transport path suffixes. This framework provides maximum control of the sampling scheme by the programmer, which can be hard to achieve with Markov chain-based methods. We show that local QMC exploration can generate results on par with state of the art light transport sampling methods, while providing more uniform convergence, improving temporal consistency.
منابع مشابه
Computational and Inferential Diiculties with Mixture Posterior Distributions 1
This paper deals with both exploration and interpretation problems related to posterior distributions for mixture models. The speciication of mixture posterior distributions means that the presence of k! modes is known immediately. Standard Markov chain Monte Carlo techniques usually have diiculties with well-separated modes such as occur here; the Markov chain Monte Carlo sampler stays within ...
متن کاملEvaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملNumerical Integration of Multivariate
In the present paper we study quasi-Monte Carlo methods to integrate functions representable by generalized Haar series in high dimensions. Using (t; m; s)-nets to calculate the quasi-Monte Carlo approximation, we get best possible estimates of the integration error for practically relevant classes of functions. The local structure of the Haar functions yields interesting new aspects in proofs ...
متن کاملQuasi-Newton Hamiltonian Monte Carlo
The Hamiltonian Monte Carlo (HMC) method has become significantly popular in recent years. It is the state-of-the-art MCMC sampler due to its more efficient exploration to the parameter space than the standard random-walk based proposal. The key idea behind HMC is that it makes use of first-order gradient information about the target distribution. In this paper, we propose a novel dynamics usin...
متن کاملA Quasi-Monte Carlo Method for Elliptic Boundary Value Problems
In this paper we present and analyze a quasi-Monte Carlo method for solving elliptic boundary value problems. Our method transforms the given partial differential equation into an integral equation by employing a well known local integral representation. The kernel in this integral equation representation can be used as a transition density function to define a Markov process used in estimating...
متن کامل